aspps - An Implementation of Answer-Set Programming with Propositional Schemata
نویسندگان
چکیده
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to process PS +-theories. It consists of two basic modules. The first module, psgrnd, grounds an PS +-theory. The second module, referred to as aspps, is a solver. It computes models of ground PS +-theories.
منابع مشابه
The aspps System
1 Introduction The aspps system is an answer-set programming system based on the extended logic of propositional schemata 2], which allows variables but not function symbols in the language. We denote this logic PS +. A theory in the logic PS + is a pair (D; P), where D is a set of ground atoms (only constant symbols as arguments) representing an instance of a problem (input data), and P is a s...
متن کاملPropositional Satisfiability in Answer-Set Programming
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional schemata and on a version of the Closed World Assumption. We call it the extended logic of propositional schemata with CWA (PS + , in symbols). An important feat...
متن کاملdcs: An Implementation of DATALOG with Constraints
Answer-set programming (ASP) has emerged recently as a viable programming paradigm. We describe here an ASP system, DATALOG with constraints or DC, based on non-monotonic logic. Informally, DC theories consist of propositional clauses (constraints) and of Horn rules. The semantics is a simple and natural extension of the semantics of the propositional logic. However, thanks to the presence of H...
متن کاملDATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem constraints. However, for some applications, especially those requiring that transitive closure be computed,...
متن کاملA Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results
The class of nonmonotonic logic programs under the answer-set semantics [5], with which we are dealing with in this paper, represents the canonical and, due to the availability of efficient answer-set solvers, arguably most widely used approach to answer-set programming (ASP). The latter is based on the idea that problems are encoded in terms of theories such that the solutions of a given probl...
متن کامل